Fixed Parameter Undecidability for Wang Tilesets
نویسندگان
چکیده
منابع مشابه
Fixed Parameter Undecidability for Wang Tilesets
Deciding if a given set of Wang tiles admits a tiling of the plane is decidable if the number of Wang tiles (or the number of colors) is bounded, for a trivial reason, as there are only finitely many such tilesets. We prove however that the tiling problem remains undecidable if the difference between the number of tiles and the number of colors is bounded by 43. One of the main new tool is the ...
متن کاملFixed Parameter Tractability and Treewidth 14 . 1 Fixed Parameter Tractability
One of the ways to cope with hard problems in practice is to realized that problem instances may be associated with some “parameters” related to their complexity. If the parameter of an instance is small, we might have some hope in finding a polynomial time solution to that instance. This idea has been investigated in the 1990’s by Downian and Fellowes in their work on fixed parameter tractabil...
متن کاملA Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth
We present an efficient fixed-parameter algorithm for #SAT parameterized by the incidence treewidth, i.e., the treewidth of the bipartite graph whose vertices are the variables and clauses of the given CNF formula; a variable and a clause are joined by an edge if and only if the variable occurs in the clause. Our algorithm runs in time O(4 k l N), where k denotes the incidence treewidth, l deno...
متن کاملFixed Parameter Inductive Inference
We investigate a particular inductive inference problem where we are given as input a finite set of ordered triples of the form (wi, bi, ti) such that wi is a bit string, bi is a single bit, and ti is a positive integer written in unary. A machine M is said to match such a triple if M outputs bi on input wi in at most ti steps. We proceed to investigate the fixed parameter problems where we fix...
متن کاملMass { A Parameter Fixed
In supersymmetric models, the well-known tension between naturalness and experimental constraints is relieved if the squarks and sleptons of the rst two generations are superheavy, with masses m heavy > 10 TeV, and all other superpartners are light, with masses m light < 1 TeV. We show that even if all scalar masses and trilinear A parameters are of order m heavy at some high scale, a hierarchy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2012
ISSN: 2075-2180
DOI: 10.4204/eptcs.90.6